Fast Algorithms for D Dominance Reporting and Counting
نویسندگان
چکیده
We present in this paper fast algorithms for the D dominance reporting and counting problems and generalize the results to the d dimensional case Our D dominance reporting algorithm achieves O log n log log n f query time using O n log n space where f is the number of points satisfying the query and is an arbitrarily small constant For the D dominance counting problem which is equivalent to the D range counting problem our algorithm runs in O log n log log n time using O nlog n log log n space
منابع مشابه
Fast Algorithms For 3-D Dominance Reporting And Counting
We present in this paper fast algorithms for the 3-D dominance reporting and counting problems, and generalize the results to the d-dimensional case. Our 3-D dominance reporting algorithm achieves O(log n= log log n + f) 1 query time using O(n log n) space , where f is the number of points satisfying the query and > 0 is an arbitrarily small constant. For the 3-D dominance counting problem (whi...
متن کاملSpace-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
We present linear-space sub-logarithmic algorithms for handling the 3-dimensional dominance reporting and the 2-dimensional dominance counting problems. Under the RAM model as described in [M. L. Fredman and D. E. Willard. “Surpassing the information theoretic bound with fusion trees”, Journal of Computer and System Sciences, 47:424– 436, 1993], our algorithms achieve O(log n/ log log n + f) qu...
متن کاملSpace-eecient and Fast Algorithms for Multidimensional Dominance Reporting and Range Counting
We present linear space sublogarithmic algorithms for handling the three dimensional dominance reporting problem and the two dimensional range counting problem Under the RAM model as described in M L Fredman and D E Willard Surpassing the information theoretic bound with fusion trees Journal of Computer and System Sciences our algorithms achieve O logn log logn f query time for D dominance repo...
متن کاملGeometric Algorithms for Private-Cache Chip Multiprocessors
We study techniques for obtaining efficient algorithms for geometric problems on private-cache chip multiprocessors. We show how to obtain optimal algorithms for interval stabbing counting, 1-D range counting, weighted 2-D dominance counting, and for computing 3-D maxima, 2-D lower envelopes, and 2-D convex hulls. These results are obtained by analyzing adaptations of either the PEM merge sort ...
متن کاملEvaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کامل